Linear Context-Free Tree Languages and Inverse Homomorphisms
نویسندگان
چکیده
We prove that the class of linear context-free tree languages is not closed under inverse linear tree homomorphisms. The proof is by contradiction: we encode Dyck words into a context-free tree language and prove that its preimage under a certain linear tree homomorphism cannot be generated by any context-free tree grammar. A positive result can still be obtained: the linear monadic context-free tree languages are closed under inverse linear tree homomorphisms.
منابع مشابه
Decision Problems for Non-regular Languages
We begin with studying closure properties of language classes. Informally, a closure property of a languages class C states that a certain type of transformation applied to languages in C always yields languages that belong to C as well. Examples for such transformations are: (i) Homomorphisms α : X∗ → Y ∗. They transform a language L ⊆ X∗ into the language α(L) = {α(w) | w ∈ L}. (ii) Inverse h...
متن کاملNonterminal Complexity of Some Operations on Context-Free Languages
We investigate context-free languages with respect to the measure Var of descriptional complexity, which gives the minimal number of nonterminals which is necessary to generate the language. Especially, we consider the behaviour of this measure with respect to operations. For given numbers c1, c2, . . . , cn and an nary operation τ on languages we discuss the range of Var(τ(L1, L2, . . . , Ln))...
متن کاملThe Copying Power of One-State Tree Transducers
One-state deterministic top-down tree transducers (or, tree homomorphisms) cannot handle “prime copying,” i.e., their class of output (string) languages is not closed under the operation L --) {$(w%~‘“’ 1 w E L, f(n) > 11, where f is any integer function whose range contains numbers with arbitrarily large prime factors (such as a polynomial). The exact amount of nonclosure under these copying o...
متن کاملClosure properties of linear context-free tree languages with an application to optimality theory
Context-free tree grammars, originally introduced by Rounds (1970a), are powerful grammar devices for the definition of tree languages. The properties of the class of context-free tree languages have been studied for more than three decades now. Particularly important here is the work by Engelfriet and Schmidt (1977, 1978). In the present paper, we consider a subclass of the class of context-fr...
متن کاملLinear Context-Free Rewriting Systems and Deterministic Tree-Walking Transducers
I n t r o d u c t i o n In [9] a comparison was made of the generative capacity of a number of grammar formalisms. Several were found to share a number of characteristics (described below) and the class of such formalisms was called linear context-free rewriting systems. This paper shows how the class of string languages generated by linear context-free rewriting systems relates to a number of ...
متن کامل